package externalSort.Tournament;

public class Node {
    public int val;
    public int term; // 表示顺串的轮次
    public boolean isLeaf;
    public int way; // 记录该节点对应的路数

    public Node(int val) {
        this.val = val;
    }

    public Node(int val, int term) {
        this.val = val;
        this.term = term;
        this.isLeaf = false;
    }
}
